/**
 * Created with IntelliJ IDEA.
 * Description:搜索插入位置
 * User: bjc
 * Date: 2025-11-16
 * Time: 15:34
 */
public class Test03_searchInsert {
    public int searchInsert(int[] nums, int target) {
        int left = 0,right = nums.length-1;
        while(left <= right){
            int mid = left +(right-left) /2;
            if(nums[mid] > target) right = mid - 1;
            else if(nums[mid] < target) left = mid + 1;
            else return mid;
        }
        return left;
    }
}
